Hamming Graph in Nomura Algebra
نویسندگان
چکیده
Let A be an association scheme on q ≥ 3 vertices. We show that the Bose-Mesner algebra of the generalized Hamming scheme H(n,A), for n ≥ 2, is not the Nomura algebra of a type II matrix. This result gives examples of formally self-dual Bose-Mesner algebras that are not the Nomura algebras of type II matrices.
منابع مشابه
The Terwilliger Algebra of a Distance-Regular Graph that Supports a Spin Model
Let denote a distance-regular graph with vertex set X , diameter D ≥ 3, valency k ≥ 3, and assume supports a spin model W . Write W = ∑D i=0 ti Ai where Ai is the i th distance-matrix of . To avoid degenerate situations we assume is not a Hamming graph and ti ∈ {t0, −t0} for 1 ≤ i ≤ D. In an earlier paper Curtin and Nomura determined the intersection numbers of in terms of D and two complex par...
متن کاملNomura algebras of nonsymmetric Hadamard models
Spin models for link invariants were introduced by Jones [7], and their connection to combinatorics was revealed first in [4]. Jaeger and Nomura [6] constructed nonsymmetric spin models for link invariants from Hadamard matrices, and showed that these models give link invariants which depend nontrivially on link orientation. These models are a modification of the Hadamard model originally const...
متن کاملSymmetric chains, Gelfand–Tsetlin chains, and the Terwilliger algebra of the binary Hamming scheme
The de Bruijn–Tengbergen–Kruyswijk (BTK) construction is a simple algorithm that produces an explicit symmetric chain decomposition of a product of chains. We linearize the BTK algorithm and show that it produces an explicit symmetric Jordan basis (SJB). In the special case of a Boolean algebra, the resulting SJB is orthogonal with respect to the standard inner product and, moreover, we can wri...
متن کاملA Graph-Theoretic Approach to Bounds for Error-Correcting Codes CIMPA-UNESCO-PHILIPPINES Summer School on Semidefinite Programming in Algebraic Combinatorics
In these notes, we address bounds for error-correcting codes. Our approach is from the viewpoint of algebraic graph theory. We therefore begin with a review of the algebraic structure of the Hamming graph, focusing on the binary case. We then derive Delsarte’s linear programming bound and explore some applications of it. In the second part of the notes, we introduce Terwilliger’s subconstituent...
متن کاملUpper bounds for ternary constant weight codes from semidefinite programming and representation theory
In this thesis we use a semidefinite programming approach to find explicit upper bounds on the size of ternary constant weight codes with prescribed minimum distance d. By constructing a graph Γ = (X,E), on the set, X, of all possible ternary words of weight w letting {x, y} ∈ E ⇔ 0 < dH(x, y) < d, we can view this problem as a special case of the stable set problem. Using symmetry, the constra...
متن کامل